Solving methods for the quay crane scheduling problem at port of Tripoli-Lebanon

An Estimation of Distribution Algorithm for Solving the Quay Crane Scheduling Problem with Availability Constraints

This work addresses the Quay Crane Scheduling Problem under availability constraints, whose main goal is to determine the work schedules of the quay cranes allocated to a container vessel in order to carry out its transhipment operations (loading and unloading operations). An Estimation of Distribution Algorithm with shaking procedure is proposed to solve it. The position of the tasks and the o...

Robust Scheduling for Berth Allocation and Quay Crane Assignment Problem

Decision makers must face the dynamism and uncertainty of real-world environments when they need to solve the scheduling problems. Different incidences or breakdowns, for example, initial data could change or some resources could become unavailable, may eventually cause the infeasibility of the obtained schedule. To overcome this issue, a robust model and a proactive approach are presented for ...

the algorithm for solving the inverse numerical range problem

برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.

Hybrid evolutionary computation methods for quay crane scheduling problems

This section provides detailed results for all sets of benchmark instances introduced by Meisel [1]. The notations of problems characteristics are the same as ones used in Meisel [1]. Loc indicates the distributions of tasks on the vessel, f indicates the the handling rate, d is the precedence density, q is the number of QCs, and s is the safety distance. The signs ∗ and ▲ respectively indicate...

Berth and quay crane scheduling: problems, models and solution methods